Characteristic Sets for Learning k-Acceptable Languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning (k, l)-Contextual Tree Languages for Information Extraction

Learning regular languages from positive examples only is known to be infeasible. A common solution is to define a learnable subclass of the regular languages. In the past, this has been done for regular string languages. Using ideas from those techniques, we define a learnable subclass of regular unranked tree languages, called the (k,l)-contextual tree languages. We describe the use of this s...

متن کامل

Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses

A tree pattern p is a first-order term in formal logic, and the language of p is the set of all the tree patterns obtainable by replacing each variable in p with a tree pattern containing no variables. We consider the inductive inference of the unions of these languages from positive examples using strategies that guarantee some forms of minimality during the learning process. By a result in ou...

متن کامل

Polynomial characteristic sets for DFA identification

We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence of data-driven grammatical inference algorithms. In this paper, we prove a sufficient condition that assures the existence of a characteristic sample whose size is polynomial wit...

متن کامل

The cardinal characteristic for relative γ-sets

For X a separable metric space define p(X) to be the smallest cardinality of a subset Z of X which is not a relative γset in X, i.e., there exists an ω-cover of X with no γ-subcover of Z. We give a characterization of p(2) and p(ω) in terms of definable free filters on ω which is related to the pseudo-intersection number p. We show that for every uncountable standard analytic space X that eithe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ECTI Transactions on Computer and Information Technology (ECTI-CIT)

سال: 1970

ISSN: 2286-9131,2286-9131

DOI: 10.37936/ecti-cit.201151.54230